Parameterised Anonymity
نویسندگان
چکیده
We introduce the notion of parameterised anonymity, to formalize the anonymity property of protocols with an arbitrary number of participants. This definition is an extension of the well known CSP anonymity formalization of Schneider and Sidiropoulos [23]. Using recently developed invariant techniques for solving parameterised boolean equation systems, we then show that the Dining Cryptographers protocol guarantees parameterised anonymity with respect to outside observers. We also argue that although the question whether a protocol guarantees parameterised anonymity is in general undecidable, there are practical subclasses where anonymity can be decided for any group of processes.
منابع مشابه
Anonymity, information, and machine-assisted proof
This report demonstrates a technique for proving the anonymity guarantees of communication systems, using a mechanised theorem-prover. The approach is based on Shannon’s theory of information and can be used to analyse probabilistic programs. The information-theoretic metrics that are used for anonymity provide quantitative results, even in the case of partial anonymity. Many of the development...
متن کاملConstruction of strict Lyapunov function for nonlinear parameterised perturbed systems
In this paper, global uniform exponential stability of perturbed dynamical systems is studied by using Lyapunov techniques. The system presents a perturbation term which is bounded by an integrable function with the assumption that the nominal system is globally uniformly exponentially stable. Some examples in dimensional two are given to illustrate the applicability of the main results.
متن کاملLogical Characterisation of Parameterised Bisimulations
We explore the relationship between bisimulations and logic. The link between them is formed by logical characterisations, which have been given for well-known bisimulation equivalences and preorders. Parameterised bisimulations allow us to incorporate notions of abstraction or efficiency into behavioural equivalences. This generalised framework of parameterised bisimulations is used to develop...
متن کاملParameterised Verification of Data-aware Multi-Agent Systems
We introduce parameterised data-aware multiagent systems, a formalism to reason about the temporal properties of arbitrarily large collections of homogeneous agents, each operating on an infinite data domain. We show that their parameterised verification problem is semi-decidable for classes of interest. This is demonstrated by separately addressing the unboundedness of the number of agents and...
متن کاملThe Parameterised Complexity of List Problems on Graphs of Bounded Treewidth
We consider the parameterised complexity of several list problems on graphs, with parameter treewidth or pathwidth. In particular, we show that List Edge Chromatic Number and List Total Chromatic Number are fixed parameter tractable, parameterised by treewidth, whereas List Hamilton Path is W[1]-hard, even parameterised by pathwidth. These results resolve two open questions of Fellows, Fomin, L...
متن کامل